By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 16, Issue 3, pp. 421-598

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On Embedding a Graph in the Grid with the Minimum Number of Bends

Roberto Tamassia

pp. 421-444

BibTeX  Abstract Full Text:  PDF

Fast Distributed Agreement

Sam Toueg, Kenneth J. Perry, and T. K. Srikanth

pp. 445-457

BibTeX  Abstract Full Text:  PDF

Tight Comparison Bounds on the Complexity of Parallel Sorting

Yossi Azar and Uzi Vishkin

pp. 458-464

BibTeX  Abstract Full Text:  PDF

Equational Bases for If–Then–Else

Alan H. Mekler and Evelyn M. Nelson

pp. 465-485

BibTeX  Abstract Full Text:  PDF

Expected Computation Time for Hamiltonian Path problem

Yuri Gurevich and Saharon Shelah

pp. 486-502

BibTeX  Abstract Full Text:  PDF

Weighted Leaf AVL-Trees

Vijay K. Vaishnavi

pp. 503-537

BibTeX  Abstract Full Text:  PDF

The Complexity of Reliable Concurrency Control

Christos H. Papadimitriou and Mihalis Yannakakis

pp. 538-553

BibTeX  Abstract Full Text:  PDF

Tighter Bounds for LPT Scheduling on Uniform Processors

Donald K. Friesen

pp. 554-560

BibTeX  Abstract Full Text:  PDF

On Shortest Paths Amidst Convex Polyhedra

Micha Sharir

pp. 561-572

BibTeX  Abstract Full Text:  PDF

Binary Search on a Tape

T. C. Hu and Michelle L. Wachs

pp. 573-590

BibTeX  Abstract Full Text:  PDF

Factoring Multivariate Polynomials over Algebraic Number Fields

Arjen K. Lenstra

pp. 591-598

BibTeX  Abstract Full Text:  PDF